JOSTLE: parallel multilevel graph-partitioning software – an overview
نویسندگان
چکیده
In this chapter we look at JOSTLE, the multilevel graph-partitioning software package, and highlight some of the key research issues that it addresses. We first outline the core algorithms and place it in the context of the multilevel refinement paradigm. We then look at issues relating to its use as a tool for parallel processing and, in particular, partitioning in parallel. Since its first release in 1995, JOSTLE has been used for many mesh-based parallel scientific computing applications and so we also outline some enhancements such as multiphase mesh-partitioning, heterogeneous mapping and partitioning to optimise subdomain shape.
منابع مشابه
JOSTLE: Partitioning of Unstructured Meshes for Massively Parallel Machines
We outline the philosophy behind a newmethod for solving the graph-partitioning problem which arises in mapping unstructured mesh calculations to parallel computers. The method, encapsulated in a software tool, JOSTLE, employs a combination of techniques including the Greedy algorithm to give an initial partition, together with some powerful optimisation heuristics. A clustering technique is ad...
متن کاملSolving the mesh-partitioning problem with an ant-colony algorithm
Many real-world engineering problems can be expressed in terms of partial differential equations and solved by using the finite-element method, which is usually parallelised, i.e. the mesh is divided among several processors. To achieve high parallel efficiency it is important that the mesh is partitioned in such a way that workloads are well balanced and interprocessor communication is minimis...
متن کاملMesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses the mesh partitioning problem. In this paper we present an enhancement of the technique that uses nature inspired metaheuristic to achieve higher quality partitions. We apply and study a multilevel ant-colony (MACO) opti...
متن کاملA new diffusion-based multilevel algorithm for computing graph partitions
Graph partitioning requires the division of a graph's vertex set into k equally sized subsets s. t. some objective function is optimized. High-quality partitions are important for many applications, whose objective functions are often NP-hard to optimize. Most state-of-the-art graph partitioning libraries use a variant of the Kernighan-Lin (KL) heuristic within a multilevel framework. While the...
متن کاملDynamic Re-Allocation of Meshes for parallel Finite Element Applications
One of the objectives of the DRAMA project it to develop a public domain library for parallel mesh re-partitioning. In this library, three families of re-partitioning techniques will be included, based on (a) graph partitioning, (b) direct element mesh migration and (c) coordinate partitioning. Section 1 of this report gives a brief overview of the various mesh re-partitioning algorithms. Secti...
متن کامل